#include <bits/stdc++.h>
using namespace std;

#define int int64_t
#define endl "\n"
using PII = pair<int, int>;
using TII = tuple<int, int, int>;
#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR2(i, a, b, c) for (int i = (int)(a); i <= (int)(b); i += c)
#define FORD(i, b, a) for (int i = (int)(a); i >= (int)(b); i--)
#define FORD2(i, b, a, c) for (int i = (int)(a); i >= (int)(b); i -= c)
#define BSI basic_string<int>
#define BSPI basic_string<PII>
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define VI vector<int>
#define VII vector<vector<int>>
#define VPII vector<PII>
#define lowbit(x) ((x)&(-x))
#define RE return;
#define RET return true;
#define REF return false;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define pb push_back
#define fi first
#define se second
#define sz size()
constexpr int N = 2e5 + 10;
constexpr int mod = 998244353;

int __FAST_IO__ = [](){
    ios::sync_with_stdio(0), cin.tie(0);
    cout.tie(0);
    cout << fixed << setprecision(12);
    return 0;
}();

int n,m;
VI g[N];
int fa[N];
map<string,int>mp;
int cnt;
map<int,int>v;

int get(string s){
    if(mp[s])return mp[s];
    return (mp[s]=++cnt);
}

int dfs(int x){
    int cnt=v[x];
    for(auto& j:g[x]){
        cnt+=dfs(j);
    }
    return cnt;
}

void solve() {
    cin>>n>>m;
    
    FOR(i,1,m){
        string a,b;
        cin>>a>>b;
        int ta=get(a),tb=get(b);
        if(isdigit(a[0])){
            fa[ta]=tb;
            v[tb]++;
        }else{
            g[tb].emplace_back(ta);
        }
    }

    while(1){
        char c;
        string a,b;
        cin>>c;
        if(c=='T'){
            cin>>a>>b;
            int ta=get(a),tb=get(b);
            v[fa[ta]]--;
            v[tb]++;
            fa[tb]=ta;
        }else if(c=='E'){
            break;
        }else{
            cin>>a;
            cout<<dfs(get(a))<<endl;
        }
    }

}

signed main() {
    int Task = 1;
    for (; Task; Task--) {
        solve();
    }
    return 0;
}